Vector Space semi-Cayley Graphs
author
Abstract:
The original aim of this paper is to construct a graph associated to a vector space. By inspiration of the classical definition for the Cayley graph related to a group we define Cayley graph of a vector space. The vector space Cayley graph ${rm Cay(mathcal{V},S)}$ is a graph with the vertex set the whole vectors of the vector space $mathcal{V}$ and two vectors $v_1,v_2$ join by an edge whenever $v_1-v_2in S$ or $-S$, where $S$ is a basis of $mathcal{V}$. This fact causes a new connection between vector spaces and graphs. The vector space Cayley graph is made of copies of the cycles of length $t$, where $t$ is the cardinal number of the field that $mathcal{V}$ is constructed over it. The vector space Cayley graph is generalized to the graph $Gamma(mathcal{V},S)$. It is a graph with vertex set whole vectors of $mathcal{V}$ and two vertices $v$ and $w$ are adjacent whenever $c_{1}upsilon+ c_{2}omega = sum^{n}_{i=1} alpha_{i}$, where $S={alpha_1,cdots,alpha_n}$ is an ordered basis for $mathcal{V}$ and $c_1,c_2$ belong to the field that the vector space $mathcal{V}$ is made of over. It is deduced that if $ S'$ is another basis for $mathcal{V}$ which is constructed by special invertible matrix $P$, then $Gamma(mathcal{V},S)cong Gamma(mathcal{V},S')$.
similar resources
Strongly Regular Semi-Cayley Graphs
We consider strongly regular graphs r = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman-Singleton graph, and the triangular graphs T(q) with q = 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We...
full textCayley graphs - Cayley nets
It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.
full textOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
full textOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
full textCayley Graphs
These notes are to help with the Homework. Not everything is as mathematically precise as one would find in a textbook. 1. Groups The information in this section is well know and can be found in most introductory books on group theory. See for example [4], [6], or [3]. 1.1. Basic Examples of Groups. Definition 1. A group is a nonempty set G with a binary operation ∗ which satisfies the followin...
full textMy Resources
Journal title
volume 13 issue 2
pages 83- 91
publication date 2018-10
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023